Computing size-independent matrix problems on systolic array processors

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Published in Systolic Array Processors

We present an overview of a prototype system based on a functional language for developing regular array circuits. The features of a simulator, oorplanner and expression transformer are discussed and illustrated.

متن کامل

Conical Systolic Array for Matrix Inversion

Matrices have been used in many analytical and simulation models and numerical solutions. Matrix operations have essential role in many scientific and engineering applications. One of the most time-consuming operations among matrix operations is matrix inversion. Many hardware designs and software algorithms have been proposed to reduce the time of computation. They will be more important for t...

متن کامل

2D matrix multiplication on a 3D systolic array

The introduction of systolic arrays in the late 1970s had an enormous impact on the area of special purpose computing. However, most of the work so far has been done with onedimensional and two-dimensional (2D) systolic arrays. Recent advances in three-<limensional VLSI (3D VLSI) and 3D packaging of2D VLSI components, has made the idea of 3D systolic arrays feasible in the near future. In this ...

متن کامل

Solving "large" dense matrix problems on multi-core processors

Few realize that for large matrices dense matrix computations achieve nearly the same performance when the matrices are stored on disk as when they are stored in a very large main memory. Similarly, few realize that, given the right programming abstractions, coding Out-of-Core (OOC) implementations of dense linear algebra operations (where data resides on disk and has to be explicitly moved in ...

متن کامل

Automatic Generation of Systolic Array Designs For Reconfigurable Computing

The problem of rapidly generating optimal parallel circuit implementations from high level, formal descriptions of affinely indexed algorithms is addressed here in the context of reconfigurable FPGA-based computing. A specialized software tool, SPADE, is described that will take a user's high level code description of his algorithms and automatically generate an abstract latency-optimal, locall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGARCH Computer Architecture News

سال: 1986

ISSN: 0163-5964

DOI: 10.1145/17356.17388